Segmentation of transport network by separation property for building transportation hub system

The article considers the problem of segmenting interrelated terminals a transport network into fixed number relatively autonomous hubs when solving technical problems. There has been proposed most common and simple option for graph partition problems - by r-partitioning. Useful practical approaches to are studied. an assessing version developing segmentation procedures their content-richness. A heuristic procedure separation property building transportation hub system is defined. For considered set there conducted study properties assessed worst scenarios. It found that regional separate using described can be carried out subclass separable tiling or on average tiling, if no further possible improvements could assessed. regionʼs have one feature: these preserve some beneficial in obtained course hub. stated serve as ground synthesis hierarchical group represented chain inner tilings, each being “good” terms cluster analysis. assessment richness partitioning analyzed computational experiment.